A modulus for curves from distance

Fréchet Distance for Curves, Revisited

We revisit the problem of computing the Fréchet distance between polygonal curves, focusing on the discrete Fréchet distance, where only distance between vertices is considered. We develop efficient approximation algorithms for two natural classes of curves: κ-bounded curves and backbone curves, the latter of which are widely used to model molecular structures. We also propose a pseudo–output-s...

Average-distance problem for parameterized curves

We consider approximating a measure by a parameterized curve subject to length penalization. That is for a given finite compactly supported measure μ, with μ(R) > 0 for p ≥ 1 and λ > 0 we consider the functional

A Method for Defuzzication by Weighted Distance

A Novel Algorithm for Digital Distance Relaying

Distance relays are used to protect EHV and HV Transmission lines. Over the past decades many algorithms have emerged for digital distance relays. These are based on the calculation of the transmission line impedance from the relaying to fault points. In this paper a novel method for digital distance relaying is proposed. In the method the tracking procedure is implemented. The method uses the ...

A Novel Algorithm for Digital Distance Relaying

Distance relays are used to protect EHV and HV Transmission lines. Over the past decades many algorithms have emerged for digital distance relays. These are based on the calculation of the transmission line impedance from the relaying to fault points. In this paper a novel method for digital distance relaying is proposed. In the method the tracking procedure is implemented. The method uses the ...